A quantum algorithm for string matching
نویسندگان
چکیده
منابع مشابه
A Faster Algorithm for Approximate String Matching
We present a new algorithm for on line approximate string matching The algorithm is based on the simulation of a non deterministic nite automaton built from the pattern and using the text as input This simulation uses bit operations on a RAM machine with word length O log n being n the maximum size of the text The running time achieved is O n for small patterns i e m O p log n independently of ...
متن کاملA Fast String Matching Algorithm
The pattern matching is a well known and important task of the pattern discovery process in today’s world for finding the nucleotide or amino acid sequence patterns in protein sequence databases. Although pattern matching is commonly used in computer science, its applications cover a wide range, including in editors, information retrieval. In this paper we propose a new pattern matching algorit...
متن کاملA Consensus Algorithm for Approximate String Matching
Approximate string matching (ASM) is a well-known computational problem with important applications in database searching, plagiarism detection, spelling correction, and bioinformatics. The two main issues with most ASM algorithms are (1) computational complexity, and (2) low specificity due to a large amount of false positives being reported. In this paper, a very efficient ASM method is propo...
متن کاملA New String Matching Algorithm
The string matching problem that appears in many applications like word processing, information retrieval, bibliographic search, molecular biology, etc., consists in finding the first or all the occurrences of a pattern in a text, where the pattern and the text are strings over the same alphabet. Many algorithms for solving this problem exist in literature [10, 20]. The naive (brute force) algo...
متن کاملAn Improved Algorithm for Approximate String Matching
Given a text string, a pattern string, and an integer k, a new algorithm for finding all occurrences of the pattern string in the text string with at most k differences is presented. Both its theoretical and practical variants improve the known algorithms . • Work supported in part by NSF Grants CCR-86-05353 and CCR-88-14977 1 Department of Computer Science, Columbia University, New York, NY 10...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: npj Quantum Information
سال: 2021
ISSN: 2056-6387
DOI: 10.1038/s41534-021-00369-3